منابع مشابه
Pram Memory Allocation and Initialization
Two techniquesfor managing memory on a parallel randomaccess machine (PRAM) are presented. One is a scheme for an n/log n processor EREW PRAM that dynamically allocates and deallocates up to n records of the same size in O(log n) time. The other is a simulation of a PRAM with initialized memory by one with uninitialized memory. A CREW PRAM variant of the technique justifies the assumption that ...
متن کاملPRAM Computations Resilient to Memory Faults
PRAMs with faults in their shared memory are investigated. Ef-cient general simulations on such machines of algorithms designed for fully reliable PRAMs are developed. The PRAM we work with is the Concurrent-Read Concurrent-Write (CRCW) variant. Two possible settings for error occurrence are considered: the errors may be either static (once a memory cell is checked to be operational it remains ...
متن کاملResource allocation in OFDM systems - Efficiency as basis for allocation and initialization
Rate and power allocation in OFDM systems is discussed extensively in literature. These approaches are either based on a finite set of realizable rates or make use of a continuous rate-power function. The motivation of this correspondence was to investigate how to transfer efficiently continuous rate allocations to realizable ones. To increase performance, we suggest to skip some realizable rat...
متن کاملThe Complexity of Deterministic PRAM Simulation on Distributed Memory Machines1
In this paper we present lower and upper bounds for the deterministic simulation of a Parallel Random Access Machine (PRAM) with n processors and m variables on a Distributed Memory Machine (DMM) with p n processors. The bounds are expressed as a function of the redundancy r of the scheme (i.e., the number of copies used to represent each PRAM variable in the DMM), and become tight for any m po...
متن کاملOptimization of PRAM-Programs with Input-Dependent Memory Access
There exist transformations of PRAM programs with predictable communication behavior to existing architectures. We extend the class of tractable programs to those with communication depending on the input. First, we deene this class of programs. Second, we give source code transformations to simplify the programs and to eliminate indirect addresses and conditionals. Third, we show how to derive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 1993
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626493000332